Algorithmic Aspects of Upper Domination: A Parameterised Perspective
نویسندگان
چکیده
This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph, with a focus on parameterised complexity. Our main results include W[1]-hardness for Upper Domination, contrasting FPT membership for the parameterised dual Co-Upper Domination. The study of structural properties also yields some insight into Upper Total Domination. We further consider graphs of bounded degree and derive upper and lower bounds for kernelisation.
منابع مشابه
Algorithmic Aspects of Upper Domination
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and minimisation problems, as well as the related parameterised problems, on general graphs and on graphs of bounded degree, and we also study planar graphs.
متن کاملThe many facets of upper domination
This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.
متن کاملUpper Domination in all its Beauty
This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملThe algorithmic complexity of signed domination in graphs
A two-valued function f defined on the vertices of a graph G (V, E), I : V -+ {-I, I}, is a signed dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every v E V, f(N[v]) 2: 1, where N(v] consists of v and every vertex adjacent to v. The of a signed dominating function is ICV) = L f( v), over all vertices v E V. The signed domination...
متن کامل